Deadlines in Real-Time Systems
نویسندگان
چکیده
This paper discusses the timeliness of real-time control services as seen by the control engineering and real-time scientific communities, arguing that computer-controllers must be designed to meet performance deadlines that, under special circumstances, can be missed as long as hard deadlines are still met. Hard and performance deadlines are central to the design of fault-tolerant real-time systems. A unified approach for the evaluation of these deadlines is presented using concepts and methodologies derived from the systems engineering and real-time literature. The control requirements of a hydraulic press are discussed as a case study illustrating the presented concepts. _____________________________________________________________________
منابع مشابه
A Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study
This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...
متن کاملA Non-Preemptive Two-Class M/M/1 System with Prioritized Real-Time Jobs under Earliest-Deadline-First Policy
This paper introduces an analytical method for approximating the performance of a two-class priority M/M/1 system. The system is fully non-preemptive. More specifically, the prioritized class-1 jobs are real-time and served with the non-preemptive earliest-deadline-first (EDF) policy, but despite their priority cannot preempt any non real-time class-2 job. The waiting class-2 jobs can only be s...
متن کاملWeakly Hard Real-Time Systems
ÐIn a hard real-time system, it is assumed that no deadline is missed, whereas, in a soft or firm real-time system, deadlines can be missed, although this usually happens in a nonpredictable way. However, most hard real-time systems could miss some deadlines provided that it happens in a known and predictable way. Also, adding predictability on the pattern of missed deadlines for soft and firm ...
متن کاملA real-time semantics for norms with deadlines
Norms have been proposed as a way to regulate multi-agent systems. In order to operationalize norms, several computational frameworks have been proposed for programming norm-governed agent organizations. It has been argued that in such systems it is essential that norms, in particular those giving rise to achievement obligations, have deadlines. In this paper we propose a novel semantic framewo...
متن کاملOptimized Deadline Assignment and Schedulability Analysis for Distributed Real-Time Systems with Local EDF Scheduling
The assignment of scheduling parameters under the Earliest Deadline First (EDF) scheduling policy is trivial in single processor systems because deadlines are used directly. However, it is still difficult to find a feasible deadline assignment for EDF distributed systems when the utilization levels of the CPUs and communication networks are pushed near to their limits. Most distributed applicat...
متن کامل